An Efficient Primal-Dual Interior-Point Algorithm for Volt/VAR Optimization in Rectangular Voltage Coordinates
نویسندگان
چکیده
Security and reliability of electrical power supply has become indispensable to modern society, the system operator is challenged manage increasingly complex in a manner that ensures expected security operation. In this context, Volt/VAR optimization (VVO) plays key role efficient delivery through transmission system, contributing significantly security, reliability, quality economy This article presents design implementation an primal-dual interior-point algorithm for solution VVO problem. The method combines constraint handling by means logarithmic barrier functions, Lagrangian theory optimization, Newton constitute one most deterministic algorithms large-scale nonlinear optimization. developed also incorporates Newton-Raphson load flow computation, which feasible with respect balance equations at each iteration algorithm. Both problems are formulated rectangular coordinates voltages. departure from researchers, who make use polar formulation, adds considerably efficiency effectiveness been demonstrated case studies performed on 6-bus IEEE 14-bus, 30-bus 118-bus test systems, have selected analyse computational scalability as it applied systems various sizes. extensive analyses conducted reveal algorithm’s efficiency, particularly being able successfully solve problem widely varying sizes without disproportionate increase cost or deterioration results. exhibits characteristics fast convergence, high problems.
منابع مشابه
Primal-dual interior-point methods for PDE-constrained optimization
Abstract. This paper provides a detailed analysis of a primal-dual interior-point method for PDE-constrained optimization. Considered are optimal control problems with control constraints in L. It is shown that the developed primal-dual interior-point method converges globally and locally superlinearly. Not only the easier L-setting is analyzed, but also a more involved L-analysis, q < ∞, is pr...
متن کاملPrimal-dual entropy-based interior-point algorithms for linear optimization
We propose a family of search directions based on primal-dual entropy in the contextof interior-point methods for linear optimization. We show that by using entropy based searchdirections in the predictor step of a predictor-corrector algorithm together with a homogeneousself-dual embedding, we can achieve the current best iteration complexity bound for linear opti-mization. The...
متن کاملA Robust Primal-Dual Interior-Point Algorithm for Nonlinear Programs
We present a primal-dual interior point algorithm of line-search type for nonlinear programs, which uses a new decomposition scheme of sequential quadratic programming. The algorithm can circumvent the convergence difficulties of some existing interior point methods. Global convergence properties are derived without assuming regularity conditions. The penalty parameter ρ in the merit function i...
متن کاملA Primal-dual Interior Point Algorithm for Convex Quadratic Programs
In this paper, we propose a feasible primal-dual path-following algorithm for convex quadratic programs.At each interior-point iteration the algorithm uses a full-Newton step and a suitable proximity measure for tracing approximately the central path.We show that the short-step algorithm has the best known iteration bound,namely O( √ n log (n+1) ).
متن کاملA Primal-Dual Interior Point Algorithm for Linear Programming
This chapter presents an algorithm that works simultaneously on primal and dual linear programming problems and generates a sequence of pairs of their interior feasible solutions. Along the sequence generated, the duality gap converges to zero at least linearly with a global convergence ratio (1 Yf/n); each iteration reduces the duality gap by at least Yf/n. Here n denotes the size of the probl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2023
ISSN: ['2169-3536']
DOI: https://doi.org/10.1109/access.2023.3266421